Dependency Detection in Interval-based Event Streams
نویسندگان
چکیده
We present a new approach to mine dependencies between streams of interval-based events that links two events if they occur in a similar manner, one being often followed by the other one in the data. The proposed technique is robust to temporal variability of events and determines the most appropriate time intervals whose validity is assessed by a χ test. TEDDY algorithm prunes the search space while certifying the discovery of all valid and significant temporal dependencies.
منابع مشابه
Mining State Dependencies Between Multiple Sensor Data Sources
Pattern mining over data streams is critical to a variety of applications such as prediction and evolution of weather phenomena or anomaly detection in security applications. Most of the current techniques attempt to discover associations between events appearing on the same data stream but are not able to discover associations over multiple heterogeneous data streams. In this work, we aim to i...
متن کاملAccelerating Dependency Graph Learning from Heterogeneous Categorical Event Streams via Knowledge Transfer
Dependency graph, as a heterogeneous graph representing the intrinsic relationships between dierent pairs of system entities, is essential to many data analysis applications, such as root cause diagnosis, intrusion detection, etc. Given a well-trained dependency graph from a source domain and an immature dependency graph from a target domain, how canwe extract the entity and dependency knowled...
متن کاملCollaborative Multimedia Analysis for Detecting Semantical Events from Broadcasted Sports Video
In this paper, we present an approach towards detecting semantical events from broadcasted sports video through collaborative multimedia analysis, called intermodal collaboration. Broadcasted video can be viewed as a set of multimodal streams such as visual, auditory, and textual (closed caption: CC) streams. Considering temporal dependency between their streams, we aim to improve the reliabili...
متن کاملMining Frequent Patterns in Uncertain and Relational Data Streams using the Landmark Windows
Todays, in many modern applications, we search for frequent and repeating patterns in the analyzed data sets. In this search, we look for patterns that frequently appear in data set and mark them as frequent patterns to enable users to make decisions based on these discoveries. Most algorithms presented in the context of data stream mining and frequent pattern detection, work either on uncertai...
متن کاملEvent Based Video Indexing by Intermodal Collaboration
In this paper, we propose event based video indexing, which is a kind of indexing by semantical contents. To achieve this, we exploit the idea of intermodal collaboration, i.e. collaborative processing taking account of the semantical dependency between multimodal information streams consisting of visual, auditory, and text (closed caption: CC) streams. The proposed method attempts to make temp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014